package org.hot100_1;

public class leetcode72 {
    public boolean canJump(int[] nums) {

        int coverRange = nums[0];
        for (int i = 1; i <coverRange; i++) {
            coverRange=Math.max(coverRange,i+nums[i]);
            if (coverRange>=nums.length){
                return true;
            }
        }
        return false;
    }
}
